#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
long long n,a[N],pan[N],ans=0;
void quick_sort(long long a[],long long l,long long r){
    if(l>=r) return;
    int x=a[(l+r)/2],i=l-1,j=r+1;
    while(i<j){
        do i++;while(a[i]<x);
        do j--;while(a[j]>x);
        if(i<j) swap(a[i],a[j]);
    }
    quick_sort(a,l,j);
    quick_sort(a,j+1,r);
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        pan[i]=1;
    }
    quick_sort(a,1,n);
    int j;
    for(int i=1;i<=n;i++){
        j=i-1;
        while(j>=1){
            if(pan[j]==1&&a[i]!=a[j]){
                pan[j]=0;
                break;
            }
            j--;
        }
    }
    for(int i=1;i<=n;i++){
        if(pan[i]==1) ans++;
    }
    printf("%d",ans);
    return 0;
}
